Segmented Information Dispersal|A New Design with Application to Erasure Correction

Segmented Information Dispersal (SID) is a new combinatorial design which arises when constructing data organizations that provide erasure correction with certain properties. This paper deenes and studies SID designs. The problem of constructing SID designs is shown to be equivalent to the problem of constructing regular directed graphs with certain properties (collision-free digraphs). The graph formulation leads to results about possible solution parameters and construction methods. The links between collision-free digraphs, strongly-regular graphs and cages are explored.